K-Shortest-Path-Based Evacuation Routing with Police Resource Allocation in City Transportation Networks
نویسندگان
چکیده
منابع مشابه
K-Shortest-Path-Based Evacuation Routing with Police Resource Allocation in City Transportation Networks
Emergency evacuation aims to transport people from dangerous places to safe shelters as quickly as possible. Police play an important role in the evacuation process, as they can handle traffic accidents immediately and help people move smoothly on roads. This paper investigates an evacuation routing problem that involves police resource allocation. We propose a novel k-th-shortest-path-based te...
متن کاملMulti-objective evacuation routing in transportation networks
0377-2217/$ see front matter Published by Elsevier doi:10.1016/j.ejor.2008.08.025 * Corresponding author. Tel.: +1 413 546 2749. E-mail addresses: [email protected] (A. Ste edu (J.M. Smith). 1 Tel.: +1 413 545 4542. In this paper, the optimal design and analysis of evacuation routes in transportation networks is examined. An methodology for optimal egress route assignment is suggested. An ...
متن کاملLoad-Balanced K-Shortest Path Routing for Circuit-Switched Networks
Issues of the load-balanced K-shortest path routing are investigated in this paper, including multiple alternative routing strategies, network loss performance, and optimal interval for network status updates. A max-min cost function for alternative path evaluation is applied to Least Loaded Routing model in circuitswitched networks. Two kinds of routing strategy which may update the network st...
متن کاملShortest-Path Routing in Arbitrary Networks
We introduce an on-line protocol which routes any set of N packets along shortest paths with congestion C and dilation D through an arbitrary network in O(C +D+log N) steps, with high probability. This time bound is optimal up to the additive log N , and it has previously only been reached for bounded-degree leveled networks. Further, we show that the above bound holds also for random routing p...
متن کاملEndhost-Based Shortest Path Routing in Dynamic Networks: Supporting Materials
Proof. The proof is based on a similar idea as in the proof of Theorem 3.1 in [2]: if we modify the link weights so that a competitive link becomes part of the optimal path and thus must be used most of the time by any good algorithm, then this link must be used sufficiently often (Ω(log T ) in T steps) by the same algorithm under the original link weights because we do not know which weight co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2015
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0131962